Birs Workshop Self-stabilizing Distributed Systems Abstracts (in Alphabetic Order by Speaker Surname) Title: Designing Self-optimizing Dhts Using Request Profiling

(in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps Abstract: Speaker: Anish Arora (Ohio State) Title: Self-Stabilizing Sensor Networks Abstract: Speaker: Alina Bejan (University of Iowa) Title: Designing Self-Optimizing DHTs using Request Profiling Abstract: Various studies on request patterns in P2P networks have confirmed the existence of the interest-based clusters. Some P2P networks that exhibit the small-world phenomenon contains clusters of peers that frequently communicate with one another, although this is not always true. However, the existence of interest-based clusters opens up the possibility of more efficient routing. In this paper we consider the problem of designing a self-optimizing overlay network and routing mechanisms to permit efficient location of resources by the periodic profiling of request patterns. Our self-optimization protocol uses selective replication of resources for restricting the sizes of the clusters, and proposes the deployment of inactive nodes for further reduction of the routing latency. The self-optimization protocol is demonstrated on the Chord network. It leads to a routing latency that scales with the size of the clusters. Speaker: Christian Boulinier (LaRIA, CNRS University of Picardie) Title: When Graph Theory helps self-stabilization Abstract: We propose a self-stabilizing and generic scheme to solve synchronization problems whose safety specification is defined from a local property. This scheme is the basis of several very efficient algorithms in terms of memory space for problems like asynchronous phase clock, local mutual exclusion, reader-writers and local group mutual exclusion. We show that all this algorithms use a phase clock whose minimum size in terms of number of states per processis at most equal toCg + Tg − 1 where Cg is the length of a maximal cycle of a shortest maximalcycle basis if the graph contains cycles, 2 for tree networks, and Tg is the length of the longuest chorless cycle (hole) if the graph contains cycles, 2 for trees. In paticular, for asynchronous phase clock problem, our solution significantly improves all the best self-stabilizing solution in the literature which are quadratic in number of states. We also proposed a silent bounded generic algorithm which can be used to transform any serial system to a distributed one. This talk was presented in PODC 2004.